Counting problem

Results: 44



#Item
31Sheepshead / Cluedo / Games / Counting / Mathematical logic

The Math Forum: Problems of the Week Problem Solving and Communication Activity Series Round 17: Playing When students do the Noticing/Wondering activity, we often have them try to group their noticings into “quantiti

Add to Reading List

Source URL: mathforum.org

Language: English - Date: 2014-02-28 13:47:59
32Mathematics education / Knowledge / Mathematical logic / Common Core State Standards Initiative / Educational psychology / Problem solving / Victorian Essential Learning Standards / Counting / Mathematical proof / Education / Education reform / Mathematics

DOC Document

Add to Reading List

Source URL: mdk12.org

Language: English - Date: 2012-08-23 15:30:20
33Mathematics education / Knowledge / Mathematical logic / Common Core State Standards Initiative / Educational psychology / Problem solving / Victorian Essential Learning Standards / Counting / Mathematical proof / Education / Education reform / Mathematics

DOCX Document

Add to Reading List

Source URL: www.mdk12.org

Language: English - Date: 2012-08-23 15:30:20
34Electronic voting / Information society / Ballot / Absentee ballot / Vote counting system / Voting system / IPad / Apple Inc. / Sociology / Politics / Elections / Election technology

Problem. Solved. Leveraging Today’s Technology to Make Voting Systems Usable, Accessible, and Secure Linda Harley, Andrew Baranak, Carrie Bell, Jerry Ray and Brad Fain

Add to Reading List

Source URL: elections.itif.org

Language: English - Date: 2013-03-04 12:47:03
35Graph theory / NP-complete problems / Complexity classes / Morphisms / Graph coloring / Graph homomorphism / Matching / P versus NP problem / Vertex cover / Theoretical computer science / Mathematics / Computational complexity theory

Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 10:46:04
36Graph homomorphism / Matching / 2-satisfiability / Bipartite graph / Counting problem / Constraint satisfaction problem / Holographic algorithm / Graph / NP-complete / Theoretical computer science / Mathematics / Graph theory

Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 10:44:44
37Graph theory / Computational problems / NP-complete problems / Constraint programming / Graph coloring / 2-satisfiability / NP-complete / Graph homomorphism / Constraint satisfaction problem / Theoretical computer science / Mathematics / Computational complexity theory

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-11 20:52:11
38Quadratic forms / Lattice points / Lie groups / Cryptography / Linear algebra / Lattice / Unimodular lattice / Modular form / Vector space / Algebra / Mathematics / Abstract algebra

COUNTING LATTICE VECTORS DENIS XAVIER CHARLES Abstract. We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that t

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2005-01-20 18:37:07
39Greatest common divisor / Fundamental theorem of arithmetic / Integer factorization algorithms / Least common multiple / Extended Euclidean algorithm / Mathematics / Number theory / Euclidean algorithm

Fraction Counting Problem Brian Rothstein December 27, 1999 1

Add to Reading List

Source URL: www.ugcs.caltech.edu

Language: English - Date: 2007-09-20 19:32:04
40Elliptic curves / Public-key cryptography / Elliptic curve cryptography / NTRU / Elliptic Curve DSA / Lattice problem / Counting points on elliptic curves / Hyperelliptic curve cryptography / Elliptic curve / Cryptography / Post-quantum cryptography / Finite fields

References [1] M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Ann. of Math. (2), 160(2):781–793, [removed]L. V. Ahlfors. Complex Analysis. McGraw-Hill Book Co., New York, third edition, 1978. An introduction to

Add to Reading List

Source URL: www.math.brown.edu

Language: English - Date: 2008-03-20 11:42:48
UPDATE